1

Why Gödel's theorem cannot refute computationalism

Geoffrey LaForte, Patrick J. Hayes, Kenneth M. Ford
Journal:
Artificial Intelligence
Year:
1998
Language:
english
File:
PDF, 1.86 MB
english, 1998
2

The Isolated D. R. E. Degrees are Dense in the R. E. Degrees

Geoffrey Laforte
Journal:
Mathematical Logic Quarterly
Year:
1996
Language:
english
File:
PDF, 1.28 MB
english, 1996
4

Presentations of computably enumerable reals

Rodney G. Downey, Geoffrey L. LaForte
Journal:
Theoretical Computer Science
Year:
2002
Language:
english
File:
PDF, 152 KB
english, 2002
5

On Schnorr and computable randomness, martingales, and machines

Rod Downey, Evan Griffiths, Geoffrey Laforte
Journal:
Mathematical Logic Quarterly
Year:
2004
Language:
english
File:
PDF, 269 KB
english, 2004
7

Relative enumerability in the difference hierarchy

Arslanov, Marat M., Laforte, Geoffrey L., Slaman, Theodore A.
Journal:
Journal of Symbolic Logic
Year:
1998
Language:
english
File:
PDF, 768 KB
english, 1998
8

A Δ02Set with Barely Σ02Degree

Rod Downey, Geoffrey Laforte and Steffen Lempp
Journal:
Journal of Symbolic Logic
Year:
1999
Language:
english
File:
PDF, 397 KB
english, 1999
10

Isolation in the CEA hierarchy

Geoffrey LaForte
Journal:
Archive for Mathematical Logic
Year:
2005
Language:
english
File:
PDF, 233 KB
english, 2005